从知识传授到育人:高职“生活中的化学”教学实践*

深挖高职院校公选课“生活中的化学”的育人元素,精心设计教学内容,运用课堂主题辩论、趣味生活实验的设计与展示、探秘生活中的化学等理论知识传授与课内外实践相结合的教学方式,实现全过程育人,充分展现了公选课在立德树人方面的价值。     

Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

On s-hamiltonian line graphs of claw-free graphs

For an integer $s\ge 0$, a graph $G$ is $s$-hamiltonian if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian, and $G$ is $s$-hamiltonian connected if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of $s$-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for $s\ge 2$, a line graph $L\left(G\right)$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected. In this paper we prove the following.(i) For an integer $s\ge 2$, the line graph $L\left(G\right)$ of a claw-free graph $G$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected.(ii) The line graph $L\left(G\right)$ of a claw-free graph $G$ is 1-hamiltonian connected if and only if $L\left(G\right)$ is 4-connected.     

A Far-Red Emitting Fluorescent Chemogenetic Reporter for In Vivo Molecular Imaging

Far-red emitting fluorescent labels are highly desirable for spectral multiplexing and deep tissue imaging. Here, we describe the generation of frFAST (far-red Fluorescence Activating and absorption Shifting Tag), a 14-kDa monomeric protein that forms a bright far-red fluorescent assembly with (4-hydroxy-3-methoxy-phenyl)allylidene rhodanine (HPAR-3OM). As HPAR-3OM is essentially non-fluorescent in solution and in cells, frFAST can be imaged with high contrast in presence of free HPAR-3OM, which allowed the rapid and efficient imaging of frFAST fusions in live cells, zebrafish embryo/larvae, and chicken embryos. Beyond enabling the genetic encoding of far-red fluorescence, frFAST allowed the design of a far-red chemogenetic reporter of protein–protein interactions, demonstrating its great potential for the design of innovative far-red emitting biosensors.     

Computational Design of Novel Allosteric Inhibitors for Plasmodium falciparum DegP

The serine protease, DegP exhibits proteolytic and chaperone activities, essential for cellular protein quality control and normal cell development in eukaryotes. The P. falciparum DegP is essential for the parasite survival and required to combat the oscillating thermal stress conditions during the infection, protein quality checks and protein homeostasis in the extra-cytoplasmic compartments, thereby establishing it as a potential target for drug development against malaria. Previous studies have shown that diisopropyl fluorophosphate (DFP) and the peptide SPMFKGV inhibit E. coli DegP protease activity. To identify novel potential inhibitors specific to PfDegP allosteric and the catalytic binding sites, we performed a high throughput in silico screening using Malaria Box, Pathogen Box, Maybridge library, ChEMBL library and the library of FDA approved compounds. The screening helped identify five best binders that showed high affinity to PfDegP allosteric (T0873, T2823, T2801, {"type":"entrez-protein","attrs":{"text":"RJC02337","term_id":"1480409465","term_text":"RJC02337"}}RJC02337, CD00811) and the catalytic binding site (T0078L, T1524, T2328, BTB11534 and 552691). Further, molecular dynamics simulation analysis revealed {"type":"entrez-protein","attrs":{"text":"RJC02337","term_id":"1480409465","term_text":"RJC02337"}}RJC02337, BTB11534 as the best hits forming a stable complex. WaterMap and electrostatic complementarity were used to evaluate the novel bio-isosteric chemotypes of {"type":"entrez-protein","attrs":{"text":"RJC02337","term_id":"1480409465","term_text":"RJC02337"}}RJC02337, that led to the identification of 231 chemotypes that exhibited better binding affinity. Further analysis of the top 5 chemotypes, based on better binding affinity, revealed that the addition of electron donors like nitrogen and sulphur to the side chains of butanoate group are more favoured than the backbone of butanoate group. In a nutshell, the present study helps identify novel, potent and Plasmodium specific inhibitors, using high throughput in silico screening and bio-isosteric replacement, which may be experimentally validated.     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.